Lazy Transfer Learning
نویسندگان
چکیده
The concept of Transfer Learning frequently rises when one has already acquired a generalpurpose classifier (e.g. human hand-writing recognizer) and want to enhance it on a similar but slightly different task (John’s hand-writing recognition). In this paper, we focus on a “lazy” setting where an accurate general purpose probabilistic classifier is already given and the transfer algorithm is executed afterwards. We propose a novel methodology to estimate the class-posterior ratio using a sparse parametric model. The new classifier therefore is obtained by multiplying the existing classifier with the approximated posterior ratio. We show the proposed method can achieve promising results through numerical and real-world experiments of text corpus and hand-writing digits classification.
منابع مشابه
Gaussian Process Decentralized Data Fusion Meets Transfer Learning in Large-Scale Distributed Cooperative Perception
This paper presents novel Gaussian process decentralized data fusion algorithms exploiting the notion of agent-centric support sets for distributed cooperative perception of largescale environmental phenomena. To overcome the limitations of scale in existing works, our proposed algorithms allow every mobile sensing agent to choose a different support set and dynamically switch to another during...
متن کاملA Lazy Ensemble Learning Method to Classification
Depending on how a learner reacts to the test instances, supervised learning divided into eager learning and lazy learning. Lazy learners endeavor to find local optimal solutions for each particular test instance. Many approaches for constructing lazy learning have been developed, one of the successful one is to incorporate lazy learning with ensemble classification. Almost all lazy learning sc...
متن کاملLearning radial basis neural networks in a lazy way: A comparative study
Lazy learning methods have been used to deal with problems in which the learning examples are not
متن کاملA Case-Based Reasoning View of Automated Collaborative Filtering
From some perspectives Automated Collaborative Filtering (ACF) appears quite similar to Case-Based Reasoning (CBR). It works on data organised around users and assets that might be considered case descriptions. In addition, in some versions of ACF, much of the induction is deferred to run time – in the lazy learning spirit of CBR. On the other hand, because of its lack of semantic descriptions ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1506.02784 شماره
صفحات -
تاریخ انتشار 2015